Section: Software and Platforms

ECPP

François Morain has been continually improving his primality proving algorithm, ECPP , originally developed in the early 1990s. Proving the primality of a 512-bit number requires less than a second on an average PC. Morain's personal record is around 25000 decimal digits, using the fastECPP variant that he started developing in 2003. The code is written in C, and based on publicly available packages (GMP , mpfr , mpc , mpfrcx ).